Distance spectra and distance energies of iterated line graphs of regular graphs
نویسندگان
چکیده
منابع مشابه
Reciprocal complementary distance spectra and reciprocal complementary distance energy of line graphs of regular graphs
The reciprocal complementary distance (RCD) matrix of a graphG is defined asRCD(G) = [rcij] where rcij = 1 1+D−dij if i 6= j and rcij = 0, otherwise, where D is the diameter of G and dij is the distance between the vertices vi and vj in G. The RCD-energy of G is defined as the sum of the absolute values of the eigenvalues of RCD(G). Two graphs are said to be RCDequienergetic if they have same R...
متن کاملD-Spectrum and D-Energy of Complements of Iterated Line Graphs of Regular Graphs
The D-eigenvalues {µ1,…,µp} of a graph G are the eigenvalues of its distance matrix D and form its D-spectrum. The D-energy, ED(G) of G is given by ED (G) =∑i=1p |µi|. Two non cospectral graphs with respect to D are said to be D-equi energetic if they have the same D-energy. In this paper we show that if G is an r-regular graph on p vertices with 2r ≤ p - 1, then the complements of iterated lin...
متن کاملEdge-distance-regular graphs are distance-regular
A graph is edge-distance-regular when it is distance-regular around each of its edges and it has the same intersection numbers for any edge taken as a root. In this paper we give some (combinatorial and algebraic) proofs of the fact that every edge-distance-regular graph Γ is distance-regular and homogeneous. More precisely, Γ is edge-distance-regular if and only if it is bipartite distance-reg...
متن کاملShilla distance-regular graphs
A Shilla distance-regular graph Γ (say with valency k) is a distance-regular graph with diameter 3 such that its second largest eigenvalue equals to a3. We will show that a3 divides k for a Shilla distance-regular graph Γ, and for Γ we define b = b(Γ) := k a3 . In this paper we will show that there are finitely many Shilla distance-regular graphs Γ with fixed b(Γ) ≥ 2. Also, we will classify Sh...
متن کاملTwo distance-regular graphs
We construct two families of distance-regular graphs, namely the subgraph of the dual polar graph of type B3(q) induced on the vertices far from a fixed point, and the subgraph of the dual polar graph of type D4(q) induced on the vertices far from a fixed edge. The latter is the extended bipartite double of the former.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Publications de l'Institut Mathematique
سال: 2009
ISSN: 0350-1302,1820-7405
DOI: 10.2298/pim0999039r